Enciclopedia Universal. 2012.
EXPSPACE — Saltar a navegación, búsqueda En teoría de la complejidad computacional, la clase de complejidad EXPSPACE es el conjunto de los problemas de decisión que pueden ser resueltos con una máquina de Turing determinista en espacio O(2p(n)), donde p(n)… … Wikipedia Español
EXPSPACE — In complexity theory, EXPSPACE is the set of all decision problems solvable by a deterministic Turing machine in O(2p(n)) space, where p(n) is a polynomial function of n. (Some authors restrict p(n) to be a linear function, but most authors… … Wikipedia
Spiel-Komplexität — In der kombinatorischen Spieltheorie gibt es mehrere Möglichkeiten die Spiel Komplexität zu messen. Im folgenden werden die folgenden Metriken beschrieben: Zustandsraum Komplexität Spielbaumgröße Entscheidungs Komplexität Spielbaum Komplexität… … Deutsch Wikipedia
PSPACE — Unsolved problems in computer science Is P = PSPACE ? PSPACE … Wikipedia
Complexity class — In computational complexity theory, a complexity class is a set of problems of related resource based complexity. A typical complexity class has a definition of the form: the set of problems that can be solved by an abstract machine M using… … Wikipedia
Computational complexity theory — is a branch of the theory of computation in theoretical computer science and mathematics that focuses on classifying computational problems according to their inherent difficulty, and relating those classes to each other. In this context, a… … Wikipedia
Класс EXPTIME — В теории сложности вычислений, класс сложности EXPTIME (иногда называемый просто EXP) это множество задач, решаемых с помощью детерминированной машины Тьюринга за время O(2p(n)), где p(n) это полиномиальная функция о … Википедия
EXPTIME — EXP redirects here; for other uses, see exp. In computational complexity theory, the complexity class EXPTIME (sometimes called EXP) is the set of all decision problems solvable by a deterministic Turing machine in O(2 p ( n )) time, where p ( n… … Wikipedia
DNA computing — is a form of computing which uses DNA, biochemistry and molecular biology, instead of the traditional silicon based computer technologies. DNA computing, or, more generally, biomolecular computing, is a fast developing interdisciplinary area.… … Wikipedia
NSPACE — In computational complexity theory, the complexity class NSPACE(f(n)) is the set of decision problems that can be solved by a non deterministic Turing machine using space O(f(n)), and unlimited time. It is the non deterministic counterpart of… … Wikipedia
